Dynamic Lambda Calculus
نویسندگان
چکیده
The goal of this paper is to lay a logical foundation for discourse theories by providing an algebraic foundation of compositional formalisms for discourse semantics as an analogon to the simply typed-calculus. Just as that can be specialized to type theory by simply providing a special type for truth values and postulating the quantiiers and connectives as constants with xed semantics, the proposed dynamic-calculus DLC can be specialized to-DRT by essentially the same measures, yielding a much more principled and modular treatment of-DRT than before, which is also expected to provide a conceptually simple basis for studying higher-order uniication for compositional discourse theories.
منابع مشابه
Combining Recursive and Dynamic Types
A denotational semantics of simply typed lambda calculus with a basic type Dynamic, modelling values whose type is to be inspected at run-time, has been given by Abadi e.a..1]. We extend this interpretation to cover (formally contractive) recursive types as well. Soundness of typing rules and freeness of run-time type errors for well-typed programs hold. The interpretation works also for implic...
متن کاملTyped Logics With States
The paper presents a simple format for typed logics with states by adding a function for register update to standard typed lambda calculus. It is shown that universal validity of equality for this extended language is decidable (extending a well-known result of Friedman for typed lambda calculus). This system is next extended to a full fledged typed dynamic logic, and it is illustrated how the ...
متن کاملIns - R 9703 1997
The paper presents a simple format for typed logics with states by adding a function for register update to standard typed lambda calculus. It is shown that universal validity of equality for this extended language is decidable (extending a well-known result of Friedman for typed lambda calculus). This system is next extended to a full edged typed dynamic logic, and it is illustrated how the re...
متن کاملType Dynamic
Even in the most expressive statically-typed languages, there are always programs that will require run-time type information. An example of such a program is the eval function, whose ouput cannot be assigned a type at compile time. Abadi et al. introduce Dynamic values to solve this problem. A Dynamic value is a pair that contains a value and a type tag for that value. The authors also introdu...
متن کاملGradual Information Flow Typing
We present a method to support the gradual evolution of secure scripts by formalizing an extension of the simply-typed lambda calculus that provides information flow constructs. These constructs allow initially insecure programs to evolve via targeted refactoring and to provide dynamic information flow guarantees via casts, as well as static information flow guarantees via labeled types.
متن کاملKamide STRONG NORMALIZATION OF PROGRAM - INDEXED LAMBDA CALCULUS
A program-indexed typed λ-calculus, λDL, is introduced. λDL has a CurryHoward correspondence with an intuitionistic variant of dynamic logics. The strong normalization theorem for λDL is proved.
متن کامل